package demo;

/**
 *   二分查找
 */
class Solution26 {
	public int search(int[] nums, int target) {
		int left = 0;
		int right = nums.length - 1;
		while(left <= right){
			int mid = left + (right-left)/2;
			// int mid = (left + right)/2;
			if(nums[mid] > target){
				right = mid - 1;
			}else if(nums[mid] < target){
				left = mid + 1;
			}else{
				return mid;
			}
		}
		return -1;
	}
}

